Chebyshev model arithmetic for factorable functions
نویسندگان
چکیده
منابع مشابه
Structure in Optimization: Factorable Programming and Functions
The purpose of this paper is to explore structures of functions in optimization. We will assume that the functions are composed of user-defined functions and are given as computer programs. Factorable functions and factorable programming problems were developed from 1967 through 1990 and are early examples of structure in nonlinear optimization. We explore the relationship between source code t...
متن کاملApproximation of Analytic Functions by Chebyshev Functions
and Applied Analysis 3 where we refer to 1.4 for the am’s and we follow the convention ∏m−1 j m · · · 1. We can easily check that cm’s satisfy the following relation: m 2 m 1 cm 2 − ( m2 − n2 ) cm am 2.2 for any m ∈ {0, 1, 2, . . .}. Theorem 2.1. Assume that n is a positive integer and the radius of convergence of the power series ∑∞ m 0 amx m is ρ > 0. Let ρ0 min{1, ρ}. Then, every solution y ...
متن کاملGlobal optimization of bounded factorable functions with discontinuities
A deterministic global optimization method is developed for a class of discontinuous functions. McCormick’s method to obtain relaxations of nonconvex functions is extended to discontinuous factorable functions by representing a discontinuity with a step function. The properties of the relaxations are analyzed in detail; in particular, convergence of the relaxations to the function is establishe...
متن کاملRelaxations of factorable functions with convex-transformable intermediates
We propose to strengthen standard factorable relaxations of global optimization problems through the use of functional transformations of intermediate expressions. In particular, we exploit convex transformability of the component functions of factorable programs as a tool in the generation of bounds. We define suitable forms of transforming functions and assess, theoretically and computational...
متن کاملArc consistency for factorable relations
An optimal arc consistency algorithm AC-4 was given by Mohr and Henderson [8]. AC4 has cost 0(ea), and cost (na) for scene labelling. Although their algorithm is indeed optimal, under certain conditions a constraint satisfaction problem can be transformed into a less complex problem. In this paper, we present conditions and mechanisms for such transformations, and show how to factor relations i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2016
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-016-0474-9